Fitness Landscape Analysis of Circles in a Square Packing Problems

نویسندگان

  • Rachael Morgan
  • Marcus Gallagher
چکیده

Fitness landscape analysis provides insight into the structural features of optimization problems. Landscape analysis techniques have been individually shown to capture specific continuous landscape features. However, results are typically for benchmark and artificial problems, and so the ability of techniques to capture real-world problem structures remains largely unknown. In this paper we experimentally examine and compare the ability of length scale analysis, dispersion, fitness distance correlation, information content, partial information content and information stability to characterise and distinguish instances of circle packing problems. Circle packing problems are an important abstraction of many real-world problems such as container loading, facility dispersion and sensor network layout problems. Experiments on incrementally scaled packings show that while all of the techniques provide some problem insight, only length scale analysis and information stability were able to clearly differentiate problem instances.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems

The paper presents a new verified optimization method for the problem of finding the densest packings of non-overlapping equal circles in a square. In order to provide reliable numerical results, the developed algorithm is based on interval analysis. As one of the most efficient parts of the algorithm, an interval-based version of a previous elimination procedure is introduced. This method repr...

متن کامل

Packing circles in a square: a theoretical comparison of various convexification techniques

We consider the problem of packing congruent circles with the maximum radius in a unit square. As a mathematical program, this problem is a notoriously difficult nonconvex quadratically constrained optimization problem which possesses a large number of local optima. We study several convexification techniques for the circle packing problem, including polyhedral and semi-definite relaxations and...

متن کامل

Static Symmetry Breaking in Circle Packing

We present new Static Symmetry-Breaking Inequalities (SSBI) [11,6] for the problem of packing equal circles in a square [9]. The new SSBIs provide a marked computational improvement with respect to past work [1], though not yet at the level where a purely Mathematical Programming (MP) based spatial Branch-and-Bound (sBB) can be competitive with a Branch-and-Bound (BB) “boosted” by combinatorial...

متن کامل

Interval Methods for Verifying Structural Optimality of Circle Packing Configurations in the Unit Square

The paper is dealing with the problem of finding the densest packings of equal circles in the unit square. Recently, a global optimization method based exclusively on interval arithmetic calculations has been designed for this problem. With this method it became possible to solve the previously open problems of packing 28, 29, and 30 circles in the numerical sense: tight guaranteed enclosures w...

متن کامل

Packing Circles in a Square A Review and New Results

There are many interesting optimization problems associated with the packing and covering of objects in a closed volume or bounded surface Typical examples arise in classical physics or chemistry where questions of the kind what does the densest packing of atoms or molecules look like when a crystal or macro molecule is formed with the lowest energy Also engineering and information science conf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014